ar X iv : 1 40 7 . 76 63 v 1 [ cs . N E ] 2 9 Ju l 2 01 4 Level - based Analysis of Genetic Algorithms and other Search Processes ⋆

Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers

In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include O (m)-time algorithms for (1 − )maximum weight f -factor and (1+ )-approximate minimum weight f -edge cover. As a byproduct, we also obtain direct algorithms for the exact cardinality versions of these problems running in O(m √ f(V )) time. The technic...

ar X iv : h ep - p h / 94 07 39 7 v 1 2 9 Ju l 1 99 4 Analysis of the anomalous events e + e − → l + l −

ar X iv : 1 10 7 . 18 93 v 1 [ cs . D M ] 1 0 Ju l 2 01 1 Benchmarking ordering techniques for nonserial dynamic programming ∗

Five ordering algorithms for the nonserial dynamic programming algorithm for solving sparse discrete optimization problems are compared in this paper. The benchmarking reveals that the ordering of the variables has a significant impact on the run-time of these algorithms. In addition, it is shown that different orderings are most effective for different classes of problems. Finally, it is shown...

ar X iv : a st ro - p h / 01 06 39 2 v 2 1 9 Ju l 2 00 1 White Dwarfs : Contributors and Tracers of the Galactic Dark – Matter Halo

We examine the claim by Oppenheimer et al. (2001) that the local halo density of white dwarfs is an order of magnitude higher than previously thought. As it stands, the observational data support the presence of a kinematically distinct population of halo white dwarfs at the >99% confidence level. A maximum-likelihood analysis gives a radial velocity dispersion a of σ h U =150 +80 −40 km s −1 a...

Top-Down Skiplists

We describe todolists (top-down skiplists), a variant of skiplists (Pugh 1990) that can execute searches using at most log2−εn +O(1) binary comparisons per search and that have amortized update timeO(ε−1 logn). A variant of todolists, called working-todolists, can execute a search for any element x using log2−εw(x)+ o(logw(x)) binary comparisons and have amortized search time O(ε−1 logw(w)). He...